| Tyson Mao | |
|---|---|
| Born | May 8, 1984 San Francisco, California, United States |
| Website | |
| http://www.rubiks.com/ | |
Tyson Mao (Taiwanese-American) (born May 8, 1984 in San Francisco, California), is a competitive Rubik's Cube solver, or a "speedcuber." He is a co-founder and a current board member of the World Cube Association, an organization that holds competitive events for the Rubik's Cube. In 2006, he set the world record for 3x3x3 blindfolded.[1] In 2006, he appeared on the CW Television Network's "Beauty and the Geek" as one of the participants of the second incarnation of the reality television show.[2]
Contents |
Tyson Mao was born in the United States to immigrants from Tainan, Taiwan. He currently lives in the San Francisco Bay Area and works as a high-frequency trader.[3] Mao graduated from the California Institute of Technology in 2006 with a degree in astrophysics.
Tyson began solving the cube during the Rubik's Cube's second boom in 2003, first using a beginner's method, then the Petrus and Fridrich methods. Tyson is credit for popularizing the "Caltech move" for solving the three diagonal corner permutation in blindfold solving.
Tyson has been the main organizer of major U.S competitions, including all US Nationals, as well as many Caltech competitions.
Tyson Mao's unofficial beginner method has been popularized by a set of 8 videos which can be viewed at Rubiks.com. This method is most famous for being used by Will Smith in his recent film The Pursuit of Happyness. The method is basically a simplified layer-by-layer approach which works much the same way as the Fridrich method. The difference is that the cross is first built around the opposite side to simplify the permutation foresight required, the first two layers are permuted individually, the last layer requires an algorithm to construct a cross, and then repetition of Lars Petrus' Sune algorithm to orient, and finally permutation requires the use of two algorithms, one for the corners and one for the edges. These algorithms may have to be executed multiple times.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||